On transmission time through k minimal paths of a capacitated-flow network

Reliability Evaluation of Stochastic-flow Network through Two Minimal Intersecting Paths under Budget and Time Constraints

A stochastic flow network (SFN) is more suitable than a general network to describe some real systems as it is composed of multistate links as well as multistate nodes. As the nodes and the links have different capacities at different time, the minimum transmission time through a stochastic flow network is not fixed. In order to shorten the transmission time, in this paper the data are allowed ...

Time - Varying K Shortest Paths

A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

effect of sub-grid scales on large eddy simulation of particle deposition in a turbulent channel flow

چکیده ندارد.

Finding paths of length k in O*(2^k) time

The k-path problem is to determine if a given graph contains a simple path of length at least k, and if so, produce such a path. When k is given as a part of the input, the problem is wellknown to be NP-complete. The general problem has many practical applications (cf. [3, 15]). The trivial algorithm enumerating all possible k-paths in an n-node graph uses Θ(nk) time, so it is only polynomial f...